The Special Application of Vehicle Routing Problem with Uncertainty Travel Times: Locomotive Routing Problem

The Vehicle Routing Problem with Stochastic and Correlated Travel Times

The Vehicle Routing Problem with Real-Time Travel Times

The paper considers a vehicle routing problem with time windows and real-time travel times. We assume the deployment of an information and communication system that is based on mobile technologies, which provides a real-time mobile connection between the dispatching centre and drivers, allows localising vehicles on road, and gives the online overview over traffic conditions. We explicitly incor...

A hybrid meta-heuristic algorithm for the vehicle routing problem with stochastic travel times considering the driver's satisfaction

A vehicle routing problem is a significant problem that has attracted great attention from researchers in recent years. The main objectives of the vehicle routing problem are to minimize the traveled distance, total traveling time, number of vehicles and cost function of transportation. Reducing these variables leads to decreasing the total cost and increasing the driver's satisfaction level. O...

The Locomotive Routing Problem

Given a schedule of trains, the locomotive planning (or scheduling) problem (LPP) is to determine the minimum cost assignment of locomotive types to trains that satisfies a number of business and operational constraints. Once this is done, the railroad has to determine the sequence of trains to which each locomotive is assigned by unit number so that it can be fueled and serviced as necessary. ...

Vehicle Routing Problem Vehicle Routing Problem

ing and non-profit use of the material is permitted with credit to the source. Statements and opinions expressed in the chapters are these of the individual contributors and not necessarily those of the editors or publisher. No responsibility is accepted for the accuracy of information contained in the published articles. Publisher assumes no responsibility liability for any damage or injury to...

Stochastic Vehicle Routing with Random Travel Times

We consider stochastic vehicle routing problems on a network with random travel and service times. A fleet of one or more vehicles is available to be routed through the network to service each node. Two versions of the model are developed based on alternative objective functions. We provide bounds on optimal objective function values and conditions under which reductions to simpler models can b...